SEQUENTIAL AND PARALLEL ALGORITHMS FOR CAUSAL EXPLANATION WITH BACKGROUND KNOWLEDGE

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential And Parallel Algorithms For Causal Explanation With Background Knowledge

This paper presents a new sequential algorithm to answer the question about the existence of a causal explanation for a set of independence statements (a dependency model), which is consistent with a given set of background knowledge. Emphasis is placed on generality, efficiency and ease of parallelization of the algorithm. From this sequential algorithm, an efficient, scalable, and easy to imp...

متن کامل

Causal Explanation with Background Knowledge

This paper presents a new sequential algorithm to answer the question about the existence of a causal explanation for a set of independence statements (a dependency model), which is consistent with a given set of background knowledge. Emphasis is placed on generality, efficiency and ease of parallelization of the algorithm. From this sequential algorithm, an efficient, scalable, and easy to imp...

متن کامل

Causal inference and causal explanation with background knowledge

This paper presents correct algorithms for answering the following two questions; (i) Does there exist a causal explanation con­ sistent with a set of background knowledge which explains all of the observed indepen­ dence facts in a sample? (ii) Given that there is such a causal explanation what are the causal relationships common to every such

متن کامل

Sequential and parallel algorithms for DNA sequencing

MOTIVATION Reconstruction of the original DNA sequence in the sequencing by the hybridization approach (SBH) requires computational support due to a large number of possible combinations. One can notice a lack of algorithms admitting false-negative data and giving in addition all possible solutions. RESULTS In this paper, a new method of sequencing has been proposed. An algorithm based on its...

متن کامل

Sequential and Parallel Approximate Convex Hull Algorithms

This paper defines the area measure of the quality of approximate convex hulls and proposes two new approximate convex hull algorithms. The first one is superior to known techniques under the area measure and comparable under the distance measure and time complexity. The second algorithm is superior to all known algorithms in both area and distance measures (including the first algorithm) while...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems

سال: 2004

ISSN: 0218-4885,1793-6411

DOI: 10.1142/s0218488504003065